Braids via term rewriting
نویسندگان
چکیده
منابع مشابه
Relating Graph and Term Rewriting via B
Dealing properly with sharing is important for expressing some of the common compiler optimizations, such as common subex-pressions elimination, lifting of free expressions and removal of invariants from a loop, as source-to-source transformations. Graph rewriting is a suitable vehicle to accommodate these concerns. In 4] we have presented a term model for graph rewriting systems (GRSs) without...
متن کاملInequalities on submodular functions via term rewriting
We devise a method for proving inequalities on submodular functions, with a term rewriting flavour. Our method comprises of the following steps: (1) start with a linear combination X of the values of the function; (2) define a set of simplification rules; (3) conclude that X ≥ Y , where Y is a linear combination of a small number of terms which cannot be simplified further; (4) calculate the co...
متن کاملTerm-Graph Rewriting Via Explicit Paths
The notion of path is classical in graph theory but not directly used in the term rewriting community. The main idea of this work is to raise the notion of path to the level of first-order terms, i.e. paths become part of the terms and not just meta-information about them. These paths are represented by words of integers (positive or negative) and are interpreted as relative addresses in terms....
متن کاملTerm Graph Rewriting and Parallel Term Rewriting
The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing. It is also known that if term graphs are allowed to contain cycles, then one term graph reduction may correspond to infinitely many term reductions. We stress that this fact can be interpreted in two ways. According to the ...
متن کاملTerm Rewriting
Contents 1 Abstract Reduction Systems Abstract Term Rewriting Systems play an important role in various areas, such as abstract data type speciications, implementations of functional programming languages and automated deduction. In this chapter we introduce several of the basic concepts and facts for TRS's. Speciically, we discuss Abstract Reduction Systems; general Term Rewriting Systems incl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2018.12.006